The Optimal Processor Cores’ Number Research for the Parallel Cluster Multiple Labeling Technique
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولOptimal Processor Assignment for Parallel Database Design
The computing time beneets of parallelism in database systems (achieved by using multiple processors to execute a query) must be weighed against communication, startup, and termination overhead costs that increase as a function of the number of processors used. We consider problems of minimizing overhead subject to allocating data among the processors according to speciied loads. We present low...
متن کاملprostate biopsy using transrectal ultrasonography; the optimal number of cores regarding cancer detection rate and complications
conclusions the best balance between detection rate of prostate cancer and infectious complications of biopsies achieved in twelve-core biopsy protocol. twelve-core biopsy enhances the rate of prostate cancer detection with minimum adverse effects. patients and materials transrectal ultrasonography (trus) guided biopsy was performed in 180 patients suspicious for prostate cancer due to either a...
متن کاملParallel Cluster Labeling for Large-Scale Monte Carlo Simulations
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with large numbers of processors. The algorithm divides physical space into rectangular cells which are assigned to processors and combines a serial local labeling p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lobachevskii Journal of Mathematics
سال: 2020
ISSN: 1995-0802,1818-9962
DOI: 10.1134/s1995080220120240